Summarizing Frequent Itemsets via Pignistic Transformation

نویسندگان

  • Francisco Guil-Reyes
  • María Teresa Daza-Gonzalez
چکیده

Since the proposal of the well-known Apriori algorithm and the subsequent establishment of the area known as Frequent Itemset Mining, most of the scientific contribution of the data mining area have been focused on the study of methods that improve its efficiency and its applicability in new domains. The interest in the extraction of this sort of patterns lies in its expressiveness and syntactic simplicity. However, due to the large quantity of frequent patterns that are generally obtained, the evaluation process, necessary for obtaining useful knowledge, it is difficult to be achieved in practice. In this paper we present a formal method to summarize the whole set of mined frequent patterns into a single probability distribution in the framework of the Transferable Belief Model (TBM). The probability function is obtained applying the Pignistic Transformation on the patterns, obtaining a compact model that synthesizes the regularities present in the dataset and serves as a basis for the knowledge discovery and decision making processes. In this work, we also present a real case study by describing an application of our proposal in the field of Neuroscience. In particular, our main goal is focused on the behavioral characterization, via pignistic distribution on attentional cognitive variables, of group of children pre-diagnosed with one of the three types of ADHD (Attention Deficit Hyperactivity Disorder).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SE Minneapolis , MN 55455 - 0159 USA TR 04 - 025 SUMMARY : Efficiently Summarizing Transactions for Clustering

Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its application to the transaction (or document) classification and clustering. However, most of the frequent-itemset based clustering algorithms need to first mine a large intermediate set of frequent itemsets in order to...

متن کامل

Mining Frequent Patterns via Pattern Decomposition

• Candidates Generation and Test (Agrawal &Srikant, 1994; Heikki, Toivonen &Verkamo, 1994; Zaki et al., 1997): Starting at k=0, it first generates candidate k+1 itemsets from known frequent k itemsets and then counts the supports of the candidates to determine frequent k+1 itemsets that meet a minimum support requirement. • Sampling Technique (Toivonen, 1996): Uses a sampling method to select a...

متن کامل

Department of Computer Science and Engineering University of

Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its application to the transaction (or document) classification and clustering. However, most of the frequent-itemset based clustering algorithms need to first mine a large intermediate set of frequent itemsets in order to...

متن کامل

A Survey on Efficient Incremental Algorithm for Mining High Utility Itemsets in Distributed and Dynamic Database

Data Mining is the process of analyzing data from different perspectives and summarizing it into useful information. It can be defined as the activity that extracts information contained in very large database. That information can be used to increase the revenue or cut costs. Association Rule Mining (ARM) is finding out the frequent itemsets or patterns among the existing items from the given ...

متن کامل

Predicting Missing Items in Shopping Carts using Fast Algorithm

Prediction in shopping cart uses partial information about the contents of a shopping cart for the prediction of what else the customer is likely to buy. In order to reduce the rule mining cost, a fast algorithm generating frequent itemsets without generating candidate itemsets is proposed. The algorithm uses Boolean vector with relational AND operation to discover frequent itemsets and generat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011